منابع مشابه
Girth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملApproximation Algorithms for Minimum Time Broadcast
This paper deals with the problem of broadcasting in minimum time in the telephone and message-passing models. Approximation algorithms are developed for arbitrary graphs as well as for several restricted graph classes. In particular, an O(vfvT)-additive approximation algorithm is given for broadcasting in general graphs, and an O(log n/ log log n) (multiplicative) ratio approximation is given ...
متن کاملMinimum time broadcast in faulty star networks
In this paper we give new results on the fault{tolerance capabilities of the star graph. We rst consider the problem of determining the maximum number r(n) of vertices in a n! vertices star graph S n such that by removing any set of vertices and/or edges from S n of cardinality at most r(n) the diameter of S n does not increase. Subsequently, we give an algorithm for broadcasting a message in S...
متن کاملMinimum-Time Broadcast under Edge-Disjoint Paths Modes
This paper aims to study broadcast and multicast communication problems in networks under several variants of the edge-disjoint path mode. We derive upper and lower bounds for the approximability ratios of these problems (i.e., the worst-case ratios of the time required for a protocol computed in polynomial time to complete, over the time of an optimal protocol). These bounds show that slight m...
متن کاملRapid Rumor Ramification: Approximating the minimum broadcast time (Extended Abstract)
Given an undirected graph representing of processors, and a source node containing a network a message that must be broadcast to all the nodes, find a scheme that accomplishes the broadcast in the minimum number of time steps. A t each time step, any processor that has received the message is allowed t o communicate the message to at most one of its neighbors in the network, i.e. can communicat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00104-2